Hybrid-view programming of nuclear fusion simulation code in the PGAS parallel programming language XcalableMP
نویسندگان
چکیده
منابع مشابه
An Efficient Implementation of Stencil Communication for the XcalableMP PGAS Parallel Programming Language
Partitioned Global Address Space (PGAS) programming languages have emerged as a means by which to program parallel computers, which are becoming larger and more complicated. For such languages, regular stencil codes are still one of the most important goals. We implemented three methods of stencil communication in a compiler for a PGAS language XcalableMP, which are 1) based on derived-datatype...
متن کاملView-Oriented Parallel Programming
Traditional parallel programming styles have many problems which hinder the development of parallel applications. The message passing style can be too complex for many programmers. While shared memory based parallel programming is relatively easy, it requires programmers to guarantee there is no data race in programs. Data race conditions are generally difficult to debug and difficult to preven...
متن کامل1 The CODE 2 . 0 Graphical Parallel Programming Language
CODE 2.0 is a graphical parallel programming system that targets the three goals of ease of use, portability, and production of efficient parallel code. Ease of use is provided by an integrated graphical/textual interface, a powerful dynamic model of parallel computation, and an integrated concept of program component reuse. Portability is approached by the declarative expression of synchroniza...
متن کاملCode generation techniques for the task-parallel programming language Spar
In this paper we describe a compilation scheme to translate implicitly parallel programs in the programming language Spar (an extension to Java) to efficient code for distributed-memory parallel computer systems. The compilation scheme is formulated as a set of transformation rules. In Spar, the language constructs for parallelization have been designed for comfortable use by the programmer, no...
متن کاملParallel Performance of Declarative Programming Using a PGAS Model
Constraint Programming is one approach to declarative programming where a problem is modeled as a set of variables with a domain and a set of relations (constraints) between them. Constraint-based Local Search builds on the idea of using constraints to describe and control local search. Problems are modeled using constraints and heuristics for which solutions are searched, using Local Search. W...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Parallel Computing
سال: 2016
ISSN: 0167-8191
DOI: 10.1016/j.parco.2016.05.016